Inverse barrier methods for linear programming

نویسندگان

  • D. den Hertog
  • C. Roos
  • T. Terlaky
چکیده

In the recent interior point methods for linear programming much attention has been given to the logarithmic barrier method. In this paper we will analyse the class of inverse barrier methods for linear programming, in which the barrier is P x r i , where r > 0 is the rank of the barrier. There are many similarities with the logarithmic barrier method. The minima of an inverse barrier function for di erent values of the barrier parameter de ne a 'central path' dependent on r, called the r{path of the problem. For r # 0 this path coincides with the central path determined by the logarithmic barrier function. We introduce a metric to measure the distance of a feasible point to a point on the path. We prove that in a certain region around a point on the path the Newton process converges quadratically. Moreover, outside this region, taking a step into the Newton direction decreases the barrier function value at least with a constant. We will derive upper bounds for the total number of iterations needed to obtain an {optimal solution. Unfortunately, these bounds are not polynomial in the input length. Only if the rank r goes to zero we get a polynomiality result, but then we are actually working with the logarithmic barrier method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Calculation of the output price vectorby applying reverse linear programming: The novel approach in DEA

In the today’s world wherein every routine is based on economic factors, there is no doubt that theoretical sciences are driven by their capabilities and affordances in terms of economy. As a mathematical tool, data envelopment analysis (DEA) is provided to economics, so that one can investigate associated costs, prices and revenues of economic units. Data Envelopment Analysis (DEA) is a linear...

متن کامل

Inverse barriers and CES-functions in linear programming

Recently much attention was paid to polynomial interior point methods, almost exclusively based on the logarithmic barrier function. Some attempts were made to prove polynomiality of other barrier methods (e.g. the inverse barrier method) but without success. Other interior point methods could be de ned based on CES-functions (CES is the abbreviation of Constant Elasticity of Substitution). The...

متن کامل

Target setting in the process of merging and restructuring of decision-making units using multiple objective linear programming

This paper presents a novel approach to achieving the goals of data envelopment analysis in the process of reconstruction and integration of decision-making units by using multiple objective linear programming. In this regard, first, we review inverse data envelopment analysis models for data reconstruction and integration. We present a model with multi-objective linear programming structure in...

متن کامل

Inputs and Outputs Estimation in Inverse DEA

The present study addresses the following question: if among a group of decision making units, the decision maker is required to increase inputs and outputs to a particular unit in which the DMU, with respect to other DMUs, maintains or improves its current efficiencylevel, how much should the inputs and outputs of the DMU increase? This question is considered as a problem of inverse data envel...

متن کامل

Dual Barrier - Projection Methods Inlinear Programming

A surjective space transformation technique is used to convert an original dual linear programming problem with equality and inequality constraints into a problem involving only equality constraints. Continuous and discrete versions of the stable gradient projection method are applied to the reduced problem. The numerical methods involve performing inverse transformations. The convergence rate ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991